A Turing machine space hierarchy
نویسنده
چکیده
This paper introduces a new, finer space complexity measure of computations on Turing machines. The complexity of a computation on a Turing machine now takes into account also the capacity of the finite control. It is proved that a slight enlarging (by an additive constant) of the complexity bound increases the computing power. The proofs are based on a new principle of diagonalization. The results are similar for deterministic and nondeterministic off-line Turing machines, auxiliary pushdown automata, auxiliary counter automata and also for their versions with an oracle.
منابع مشابه
The Log Space Oracle Hierarchy Collapses DRAFT
The polynomial time hierarchy of Meyer and Stockmeyer has several equivalent characterizations — in particular it can be defined either in terms of polynomial time oracle Turing machines [Sto76], or in terms of polynomial time alternating Turing machines where the number of alternations is finitely bounded [CKS81]. One of the most important open questions in the area is whether or not this hier...
متن کاملSeparating Complexity Classes Using Autoreducibility
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all Turing-complete sets for certain levels of the exponential-time hierarchy are autoreducible but there exists some Turing-complete set for doubly exponential space that ...
متن کاملTime-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n time and n1− space for any > 0 on general random-access nondeterministic Turing machines. In particular, SAT cannot be solved deterministically by a Turing machine using quasilinear time and √ n space. We also give lower bounds for log-space unifo...
متن کاملTime-Space Tradeoffs for Nondeterministic Computation
We show new tradeoffs for satisfiability and nondeterministic linear time. Satisfiability cannot be solved on general purpose random-access Turing machines in time n and space n. This improves recent results of Fortnow and of Lipton and Viglas. In general, for any constant a less than the golden ratio, we prove that satisfiability cannot be solved in time n and space n for some positive constan...
متن کاملTuring-equivalent automata using a fixed-size quantum memory
In this paper, we introduce a new public quantum interactive proof system and the first quantum alternating Turing machine: qAM proof system and qATM, respectively. Both are obtained from their classical counterparts (Arthur-Merlin proof system and alternating Tur-ing machine, respectively,) by augmenting them with a fixed-size quantum register. We focus on space-bounded computation, and obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Kybernetika
دوره 15 شماره
صفحات -
تاریخ انتشار 1979